Improved Approximation Algorithms for Relay Placement
نویسندگان
چکیده
منابع مشابه
Improved approximation algorithms for single-tiered relay placement
We consider the problem of Single-Tiered Relay Placement with Basestations, which takes as input a set S of sensors and a set B of basestations described as points in a normed space (M,d), and real numbers 0 < r ≤ R. The objective is to place a minimum cardinality set Q of wireless relay nodes that connects S and B according to the following rules. The sensors in S can communicate within distan...
متن کاملImproved Algorithms for Point Placement
Signal Integrity plays a crucial role in high performance systems. Designers spend signiicant amounts of time in deciding correct circuit topologies which yield acceptable noise and delay margins. Our work on signal integrity driven placement focuses on algorithms which obey signal integrity toplogy constraints. Given a set of chips, the associated pin-to-pin delay requirements and a layout boa...
متن کاملRelay Placement Approximation Algorithms for k-Connectivity in Wireless Sensor Networks
Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g, due to failures of some sensors, or loss of battery power). In this paper we consider the problem of adding the smallest number of additional (relay) nodes so that the induced communication graph is k-connected. The problem is ...
متن کاملApproximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity for storing data objects, so as to minimize the average data-access cost. We introduce the data placement problem to model this problem. We have a set of caches F , a set of clients D, and a set of data objects O. Each c...
متن کاملA survey on relay placement with runtime and approximation guarantees
We discuss aspects and variants of the fundamental problem of relay placement: given a set of immobile terminals in the Euclidean plane, place a number of relays with limited viewing range such that the result is a low-cost communication infrastructure between the terminals. We first consider the problem from a global point of view. The problem here is similar to forming discrete Steiner tree s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2814938